BOOK REVIEW: Griffiths G.C.D.: Anthomyiidae. In Griffiths G.C.D. (ed.): FLIES OF THE NEARCTIC REGION. Vol. VIII, Part 2, No. 15. pp. 2485-2635.

Investigating GCD In Z [ √ 2 ]

We attempt to optimize the time needed to calculate greatest common divisors in the Euclidean domain Z[ √ 2].

Cover vol. 15, no. 2, April 2018

Erratum—Vol. 15, No. 2

1. García AL, Parrado R, Rojas E, Delgado R, Dujardin JC, Reithinger R. Leishmaniasis in Bolivia: comprehensive review and current status. Am J Trop Med Hyg. In press. 2. Reithinger R, Dujardin JC, Louzir H, Pirmez C, Alexander B, Brooker S. Cutaneous leishmaniasis. Lancet Infect Dis. 2007;7:581–96. DOI: 10.1016/S14733099(07)70209-8 3. Davies CR, Reithinger R, Campbell-Lendrum D, Feliciangeli D...

GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation

A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The algorithm is based on evaluation at a single large integer value (for each variable), integer GCD computation, and a single-point interpolation scheme. Timing comparisons show that this algorithm is very efficient for most univariate problems and it is also the algorithm of choice for many problems...

The gcd-sum function

The gcd-sum is an arithmetic function defined as the sum of the gcd’s of the first n integers with n : g(n) = ∑n i=1(i, n). The function arises in deriving asymptotic estimates for a lattice point counting problem. The function is multiplicative, and has polynomial growth. Its Dirichlet series has a compact representation in terms of the Riemann zeta function. Asymptotic forms for values of par...